搜索 - 腾讯云开发者社区-腾讯云

文章/答案/技术大牛

发布

来自专栏SnailTyan
Diameter of Binary Tree
Solution /** * Definition for a binary tree node.
46620发布于 2019-05-25
来自专栏SnailTyan
Binary Tree Paths
Solution Recursive /** * Definition for a binary tree node. searchPath(root->right, s, result); } } }; Iterative /** * Definition for a binary tree node
43310发布于 2019-05-25
来自专栏皮皮星球
Tree - 257. Binary Tree Paths
Binary Tree Paths Given a binary tree, return all root-to-leaf paths. 代码： go： /** * Definition for a binary tree node.
57320发布于 2020-09-23
来自专栏皮皮星球
Tree - 226. Invert Binary Tree
Invert Binary Tree Invert a binary tree. / \ 7 2 / \ / \ 9 6 3 1 思路：递归求解翻转每个不为nil的节点代码： go： /** * Definition for a binary tree node
69620发布于 2020-09-23
来自专栏皮皮星球
Tree - 110. Balanced Binary Tree
Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the depth of the Example 1: Given the following tree [3,9,20,null,null,15,7]: 3 / \ 9 20 / \ 15 7 Example 2: Given the following tree [1,2,2,3,3,null,null,4,4]: 1 / \ 2 2 / \ 代码： go： /** * Definition for a binary tree node.
53810发布于 2020-09-23
来自专栏calmound
Maximum Depth of Binary Tree
问题：二叉树的最深深度 class Solution { public: void dfs(TreeNode *root,int step,int &MAX) { if(root==NULL) { if(MAX<step) MAX=step; return ; } dfs(root->left,step+1); dfs(root->right,step+1);
50130发布于 2018-04-17
来自专栏calmound
Minimum Depth of Binary Tree
题意：二叉树的最小深度注意 1.当root为空的时候直接返回0，因为MIN赋值很大，所以如果不单独预判的话会返回MIN 2.判断树的深度应该到叶子节点，也就是左右子结点都为空的那个结点 3.树的深度的根节点深度为1 class Solution { public: void dfs(TreeNode *root,int &MIN,int step) { if(root==NULL) return ; if(root->
69770发布于 2018-04-17
来自专栏给永远比拿愉快
Leetcode: Balanced Binary Tree
题目： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the C++参考示例代码： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left
41920发布于 2019-01-22
来自专栏蛮三刀的后端开发专栏
Minimum Depth of Binary Tree
这题有意思的是，并不能直接将求最大深度的max改为min就完了，有很多坑在里面。一开始我以为只要将[],[0],[1,2]等情况考虑掉就可以了，其实在只有一边又子节点的情况下，是仍然需要遍历的。例如：
45420发布于 2019-03-26
来自专栏SnailTyan
Binary Tree Inorder Traversal
问题描述 Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. 2. /** * Definition for a binary tree node.
39510发布于 2019-05-25
来自专栏calmound
Binary Tree Preorder Traversal
二叉树的前序遍历递归实现 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode
63580发布于 2018-04-17
来自专栏皮皮星球
Tree - 111. Minimum Depth of Binary Tree
Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. Example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its 代码： go： /** * Definition for a binary tree node.
53120发布于 2020-09-23
来自专栏皮皮星球
Tree - 145. Binary Tree Postorder Traversal
Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes' values 代码： go： /** * Definition for a binary tree node.
54210发布于 2020-09-23
来自专栏calmound
Binary Tree Inorder Traversal
问题：二叉树中序遍历递归实现 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode
60360发布于 2018-04-17
来自专栏蛮三刀的后端开发专栏
Validate Binary Search Tree
想到了中序遍历整棵树，那么结果应该是升序的。直接套用之前的中序遍历代码，稍加修改即可。网上的答案很多都在分析负无穷正无穷（效率高？），我觉得能和之前中序遍历串起来就足够了。
53630发布于 2019-03-26
来自专栏蛮三刀的后端开发专栏
Binary Tree Inorder Traversal
self.generate(root, result) return result 迭代和前序后序不同，需要遵循上面的思路 class Solution: # @param root, a tree
49120发布于 2019-03-26
来自专栏calmound
Binary Tree Postorder Traversal
二叉树的后序遍历递归实现 /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode
62180发布于 2018-04-17
来自专栏尾尾部落
Maximum Depth of Binary Tree
Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. 参考代码： Java /** * Definition for a binary tree node.
50740发布于 2018-09-04
来自专栏搬砖记录
44 Binary Search Tree to Greater Sum Tree
题目 Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the original tree that are greater than or equal to node.val As a reminder, a binary search tree is a tree that satisfies these constraints: The left subtree of a Both the left and right subtrees must also be binary search trees. Example 1: ? The given tree is a binary search tree. 分析题意：从右到左、下到上累加和，赋给当前节点。
62330发布于 2021-08-18
来自专栏皮皮星球
Tree - 297. Serialize and Deserialize Binary Tree
Serialize and Deserialize Binary Tree Serialization is the process of converting a data structure or Design an algorithm to serialize and deserialize a binary tree. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure. ,null,null,4,5]" Clarification: The above format is the same as how LeetCode serializes a binary tree
48810发布于 2020-09-23

第 2 页第 3 页第 4 页第 5 页第 6 页第 7 页第 8 页第 9 页第 10 页第 11 页

点击加载更多

Diameter of Binary Tree

Binary Tree Paths

Tree - 257. Binary Tree Paths

Tree - 226. Invert Binary Tree

Tree - 110. Balanced Binary Tree

Maximum Depth of Binary Tree

Minimum Depth of Binary Tree

Leetcode: Balanced Binary Tree

Minimum Depth of Binary Tree

Binary Tree Inorder Traversal

Binary Tree Preorder Traversal

Tree - 111. Minimum Depth of Binary Tree

Tree - 145. Binary Tree Postorder Traversal

Binary Tree Inorder Traversal

Validate Binary Search Tree

Binary Tree Inorder Traversal

Binary Tree Postorder Traversal

Maximum Depth of Binary Tree

44 Binary Search Tree to Greater Sum Tree

Tree - 297. Serialize and Deserialize Binary Tree

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐